Transient Moments of the Tcp Window Size Process

نویسنده

  • ANDREAS H. LÖPKER
چکیده

The TCP window size process can be modeled as a piecewise-deterministic Markov process that increases linearly and experiences downward jumps at Poisson times. We present a transient analysis of this window size process. Our main result is the Laplace transform of the transient moments. Formulae for the integer and fractional moments are derived, as well as an explicit characterization of the speed of convergence to steady state. Central to our approach are the infinitesimal generator and Dynkin’s martingale.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The stationary behavior of ideal TCP congestionavoidanceTeunis

This note derives the stationary behavior of idealized TCP congestion avoidance. More speciically, it derives the stationary distribution of the congestion window size if loss of packets are independent events with equal probability. The mathematical derivation uses a uid ow, continuous time, approximation to the discrete time process (W n), where W n is the congestion window after the n-th pac...

متن کامل

The stationary behavior of ideal TCP congestion avoidance

This note derives the stationary behavior of idealized TCP congestion avoidance. More speci cally, it derives the stationary distribution of the congestion window size if loss of packets are independent events with equal probability. The mathematical derivation uses a uid ow, continuous time, approximation to the discrete time process (Wn), where Wn is the congestion window after the n-th packe...

متن کامل

Analysis of MIMD congestion control algorithm for high speed networks

Proposals to improve the performance of TCP in high speed networks have been recently put forward. Examples of such proposals include High-Speed TCP, Scalable TCP, and FAST. In contrast to the additive increase multiplicative decrease algorithm used in the standard TCP, Scalable TCP uses a multiplicative increase multiplicative decrease (MIMD) algorithm for the window size evolution. In this pa...

متن کامل

Analysis of Scalable TCP

Scalable TCP [2] is a proposition for a new TCP where both the increase and the decrease rate of the window size are multiplicative. It has been recently proposed in order to improve performance in high speed networks. In this paper, we present a mathematical analysis of such multiplicative increase multiplicative decrease protocols in the presence of random losses. These are typical to wireles...

متن کامل

Analyzing Steady State and Transient State Performance of Transmission Control Protocol in the Internet

The Internet uses a window-based congestion control mechanism in TCP (Transmission Control Protocol). In the literature, there have been a great number of analytical studies on TCP. Most of those studies have focused on the statistical behavior of TCP by assuming a constant packet loss probability in the network. However, the packet loss probability, in reality, changes according to packet tran...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008